Перевод: со всех языков на английский

с английского на все языки

context-free rule

См. также в других словарях:

  • Context-free grammar generation algorithms — are algorithms which generate a context free grammar or grammars from given symbol sequence or sequences.Applications for such algorithms include lossless data compression and data mining. A list of algorithms * Sequitur * Lempel Ziv Welch… …   Wikipedia

  • Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… …   Wikipedia

  • context-free — adjective Date: 1964 of, relating to, or being a grammar or language based on rules that describe a change in a string without reference to elements outside of the string; also being such a rule …   New Collegiate Dictionary

  • context-free grammar — noun a formal grammar in which every production rule is such that the left hand side is exactly one non terminal symbol and the right hand side is zero or more terminal symbols and/or nonterminal symbols. Abbreviation: CFG …   Wiktionary

  • context-free — ˈ ̷ ̷ ˌ ̷ ̷ ¦ ̷ ̷ adjective : of, relating to, or being a grammar or language based on rules that describe a change in a string without reference to elements outside of the string ; also : being such a rule …   Useful english dictionary

  • Stochastic context-free grammar — A stochastic context free grammar (SCFG; also probabilistic context free grammar, PCFG) is a context free grammar in which each production is augmented with a probability. The probability of a derivation (parse) is then the product of the… …   Wikipedia

  • Weighted context-free grammar — A weighted context free grammar (WCFG) is a context free grammar where each production has a numeric weight associated with it. The weight of a parse tree in a WCFG is the weight of the rule used to produce the top node, plus the weights of its… …   Wikipedia

  • Rule 184 — is a one dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems:* Rule 184 can be used as a simple model for… …   Wikipedia

  • Context-sensitive grammar — A context sensitive grammar (CSG) is a formal grammar in which the left hand sides and right hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols. Context sensitive grammars are more general than… …   Wikipedia

  • Free trade debate — Free trade is one of the most debated topics in economics of the 20th and 21st century Fact|date=December 2007. Arguments over free trade can be divided into economic, moral, and socio political arguments. The academic debate among economists is… …   Wikipedia

  • Rule, Britannia! — is a British patriotic song, originating from the poem Rule, Britannia by James Thomson and set to music by Thomas Arne in 1740. [cite book | last = Scholes| first = Percy A| title = The Oxford Companion to Music (tenth Edition)| publisher =… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»